A High-Level Language for Programming Cellular Algorithms on Parallel Machines
نویسندگان
چکیده
This paper describes CARPET, a parallel programming language based on the cellular automata model. A CARPET implementation has been used for programming cellular algorithms in the CAMEL parallel environment. CAMEL is an environment designed to support the development of high performance applications in science and engineering. It offers the computing power of a highly parallel computer, hiding the architecture issues from a user. By CARPET a user might write programs to describe the actions of thousands of simple active agents interacting locally, then the CAMEL system allows a user to observe the global complex evolution that arises from all the local interactions.
منابع مشابه
Modeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...
متن کاملSolving Polynomial Systems Symbolically and in Parallel
We discuss the parallelization of algorithms for solving polynomial systems symbolically. We introduce a component-level parallelization: our objective is to develop a parallel solver for which the number of processors in use depends on the intrinsic complexity of the input system, that is on geometry of its solution set. This approach creates new opportunities for parallel execution of polynom...
متن کامل